package longest_substring;

import java.util.HashMap;
import java.util.Map;

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        int count = 0;
        Map<String,Integer> map = new HashMap<>(s.length());
        for (int i=0; i< s.length(); i++) {
            String temp = s.substring(i,i+1);
            Integer integer = map.get(temp);
            if (integer == null) {
                map.put(temp,0);
                count ++;
            }else {
                for () {

                }
            }
        }
        return 0;
    }
}
